Fast Token Distribution on Recon gurable Meshes

The token distribution problem is an important data distribution problem akin to the problems of sorting and routing, in which data elements, or tokens-must be evenly distributed amongst the processors of a parallel network. To date, all algorithms to solve this problem on the mesh and reconngurable mesh architectures have lagged (in terms of the time required to obtain a solution) the state-of-the-art solutions to equivalent sorting and routing problems, despite there being evidence (a smaller bisection lower bound) that the problem of token distribution is inherently simpler than either of these. In this paper, we propose an algorithm whose performance is asymptotically equivalent to that of state-of-the-art sorting and permutation routing algorithms on reconngurable meshes with non-serial busses, and performance asymptotically equivalent to the bisection bound for meshes with serial busses.